Transformations of High-Level Synthesis Codes for High-Performance Computing
نویسندگان
چکیده
Spatial computing architectures promise a major stride in performance and energy efficiency over the traditional load/store devices currently employed large scale systems. The adoption of high-level synthesis (HLS) from languages such as C++ OpenCL has greatly increased programmer productivity when designing for platforms. While this enabled wider audience to target spatial architectures, optimization principles known software design are no longer sufficient implement high-performance codes, due fundamentally distinct aspects hardware design, programming deep pipelines, distributed memory resources, scalable routing. To alleviate this, we present collection optimizing transformations HLS, targeting efficient (HPC) applications. We systematically identify classes (pipelining, scalability, memory), characteristics their effect on HLS code resulting (e.g., increasing data reuse or resource consumption), objectives that each transformation can resolve interface contention, increase parallelism). show how these be used efficiently exploit pipelining, on-chip fast memory, dataflow, allowing massively parallel architectures. quantify various transformations, cover process sample set HPC kernels, provided open source reference codes. aim establish common toolbox guide both engineers compiler tapping into potential offered by using HLS.
منابع مشابه
High-Level Test Synthesis Using Design Transformations
A transformation-based approach to high-level test synthesis is presented. It utilizes a sequence of design-improvement transformations to generate a register-transfer level design from a VHDL behavioral specification. Selection of transformations is based on a performance-driven optimization strategy as well as a testability analysis algorithm which determines the testability-improvement techn...
متن کاملCoupling Loop Transformations and High-Level Synthesis
Résumé In this paper we present our study of adding an advanced preprocessing code transformation step to high-level synthesis (HLS) tools. Our approach is to use advanced state-of-the-art compiler frontend as an independent C-to-C preprocessing step before synthesis. By using this approach, recent state-ofthe-art compiler advances could be used directly in HLS, eliminating their reengineering ...
متن کاملTransformations Supporting Interactive Rescheduling for High-Level Synthesis
Traditionally, high-level synthesis (HLS) has been a fully automatic process over which the user has had little or no control. To make HLS an acceptable methodology for expert designers, we need to allow for more interactivity during synthesis. Since the scheduling step in HLS often determines the scope and quality of the ensuing synthesis tasks, we describe behavior-preserving transformations ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملHigh performance computing challenges for research and industrial simulation codes
Computing hardware, from mobile devices to supercomputer clusters, is undergoing a paradigm shift : with the advent of multicore CPUs and accelerators (GPUs, Intel Xeon Phi), parallelism is becoming hierarchical, ubiquitous, heterogeneous, and more and more complex. Performance critical applications need new programming models to exploit efficiently such architectures. Guided by Herb Sutter ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2021
ISSN: ['1045-9219', '1558-2183', '2161-9883']
DOI: https://doi.org/10.1109/tpds.2020.3039409